Least domination in a graph
نویسندگان
چکیده
منابع مشابه
The convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملDomination in Jahangir Graph
Given graph G = (V,E), a dominating set S is a subset of vertex set V such that any vertex not in S is adjacent to at least one vertex in S. The domination number of a graph G is the minimum size of the dominating sets of G. In this paper we study some results on domination number, connected, independent, total and restrained domination number denoted by γ(G), γc(G) ,γi(G), γt(G) and γr(G) resp...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملStrong weak domination and domination balance in a graph
Let G = (V, E) be a graph and u, v ~ V. Then, u strongly dominates v and v weakly dominates u if (i) uv ~ E and (ii) deg u >/deg v. A set D c V is a strong-dominating set (sd-set) of G if every vertex in V D is strongly dominated by at least one vertex in D. Similarly, a weak-dominating set (wd-set) is defined. The strong (weak) domination number 7s (7w) of G is the minimum cardinality of an sd...
متن کاملOn exponential domination and graph operations
An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00180-5